- vertex deleted subgraph
- подграф с удалённой вершиной
English-Russian scientific dictionary. 2008.
vertex deleted subgraph
Смотреть что такое "vertex deleted subgraph" в других словарях:
Reconstruction conjecture — Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to KellyKelly, P. J., [http://projecteuclid.org/getRecord?id=euclid.pjm/1103043674 A congruence theorem for trees] ,… … Wikipedia
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
Biased graph — In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a… … Wikipedia
Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… … Wikipedia
Arboricity — The arboricity of an undirected graph is the minimum number of forests into which its edges can be partitioned. Equivalently it is the minimum number of spanning trees needed to cover all the edges of the graph.ExampleThe figure shows the… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Small-world network — In mathematics and physics, a small world network is a type of mathematical graph in which most nodes are not neighbors of one another, but most nodes can be reached from every other by a small number of hops or steps. A small world network,… … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
